Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem
نویسندگان
چکیده
The survivable network design problem is a classical problem in combinatorial optimization of constructing a minimum-cost subgraph satisfying predetermined connectivity requirements. In this paper we consider its geometric version in which the input is a complete Euclidean graph. We assume that each vertex v has been assigned a connectivity requirement rv . The output subgraph is supposed to have the vertex(or edge-, respectively) connectivity of at least min{rv, ru} for any pair of vertices v, u. We present the first polynomial-time approximation schemes (PTAS) for basic variants of the survivable network design problem in Euclidean graphs. We first show a PTAS for the Steiner tree problem, which is the survivable network design problem with rv ∈ {0, 1} for any vertex v. Then, we extend it to include the most widely applied case where rv ∈ {0, 1, 2} for any vertex v. Our polynomial-time approximation schemes work for both vertexand edge-connectivity requirements in timeO(n logn), where the constants depend on the dimension and the accuracy of approximation. Finally, we observe that our techniques yield also a PTAS for the multigraph variant of the problem where the edge-connectivity requirements satisfy rv ∈ {0, 1, . . . , k} and k = O(1).
منابع مشابه
Polynomial-Time Approximation Schemes
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-connectivity survivable-network design, and subset TSP. The schemes run in O(n log n) time for graphs embedded on both orientable and nonorientable surfaces. This work generalizes the PTAS frameworks of Borradaile, Klein, ...
متن کاملApproximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs
We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edgeweighted undirected planar graphs that are resistant to edge or vertex removal. We first give a PTAS for the problem of finding minimum-weight 2-edge-connected spanning subgraphs where duplicate edges are allowed. Then we present a new greedy spanner construction for edge-w...
متن کاملA Fast Strategy to Find Solution for Survivable Multicommodity Network
This paper proposes an immediately efficient method, based on Benders Decomposition (BD), for solving the survivable capacitated network design problem. This problem involves selecting a set of arcs for building a survivable network at a minimum cost and within a satisfied flow. The system is subject to failure and capacity restriction. To solve this problem, the BD was initially proposed with ...
متن کاملTitle from Practice to Theory; Approximation Schemes for Clustering and Network Design
Abstract What are the performance guarantees of the algorithms used in practice for clustering and network design problems? We answer this question by showing that the standard local search algorithm returns a nearly-optimal solution for low-dimensional Euclidean instances of the traveling salesman problem, Steiner tree, k-median and k-means. The result also extends to the case of graphs exclud...
متن کاملFast Approximation Algorithms for the Generalized Survivable Network Design Problem
In a standard f -connectivity network design problem, we are given an undirected graph G = (V,E), a cut-requirement function f : 2 → N, and non-negative costs c(e) for all e ∈ E. We are then asked to find a minimum-cost vector x ∈ N such that x(δ(S)) ≥ f(S) for all S ⊆ V . We focus on the class of such problems where f is a proper function. This encodes many well-studied NP-hard problems such a...
متن کامل